Koha online catalog › Results of search for 'su:"Computational complexity"'

	1.	Randomness and Completeness in Computational Complexity by Melkebeek, Dieter van. Material type: Book; Format: print ; Literary form: Not fiction Publisher: Berlin: Springer, 2004Availability: Items available for loan: [Call number: 004 MEL] (1). Place hold
	2.	Efficient checking of polynomials and proofs and the hardness of approximation problems by Sudan, Madhu. Material type: Book; Format: print ; Literary form: Not fiction Publisher: Berlin: Springer, 1995Availability: Items available for loan: [Call number: 004 SUD] (1). Place hold

Koha online